An Effective Approach for Solving Subgraph Isomorphism Problem
نویسنده
چکیده
A novel and effective approach is presented in this paper for solving the wellknown difficult problem of subgraph isomorphism. By integrating planning strategies with the concept of centered spanning tree, the presented approach achieves an average-case, near-linear performance. A majority of practical subgraph isomorphism problems deals with the cases of labeled graphs, which contains the NPcomplete case of unlabeled graphs. This meaningful relationship between the sizes of label sets and graphs is exploited by both analyses and experimental results for use in the prediction of performance.
منابع مشابه
Subgraph Isomorphism in Temporal Networks
Temporal information is increasingly available as part of large network data sets. This information reveals sequences of link activations between network entities, which can expose underlying processes in the data. Examples include the dissemination of information through a social network, the propagation of musical ideas in a music sampling network, and the spread of a disease via contacts bet...
متن کاملThe Subgraph Isomorphism Problem on a Class of Hyperedge Replacement Languages
A graph class is called A-free if every graph in the class has no graph in the set A as an induced subgraph. Such characterisations by forbidden induced subgraphs are (among other purposes) very useful for determining whether A-free is a subclass of B-free, by determining whether every graph in B has some graph in A as an induced subgraph. This requires solving the Subgraph Isomorphism Problem,...
متن کاملSymmetry Breaking in Subgraph Pattern Matching
Graph pattern matching, a central application in many fields, can be modelled as a CSP. This CSP approach can be competitive with dedicated algorithms. In this paper, we develop symmetry breaking techniques for subgraph matching in order to increase the number of tractable instances. Specific detection techniques are first developed for the classical variables symmetries and value symmetries. I...
متن کاملSolving Hard Subgraph Problems in Parallel
We look at problems involving finding subgraphs in larger graphs, such as the maximum clique problem, the subgraph isomorphism problem, and the maximum common subgraph problem. We investigate variable and value ordering heuristics, different inference strategies, intelligent backtracking search (backjumping), and bitand thread-parallelism to exploit modern hardware.
متن کاملFinding Planted Subgraphs with Few Eigenvalues using the Schur-Horn Relaxation
Extracting structured subgraphs inside large graphs – often known as the planted subgraph problem – is a fundamental question that arises in a range of application domains. This problem is NP-hard in general, and as a result, significant efforts have been directed towards the development of tractable procedures that succeed on specific families of problem instances. We propose a new computation...
متن کامل